Improved construction of irregular progressive edge-growth Tanner graphs

The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the original algorithm that improves the performance of these codes in the waterfall region when constructing codes complying with both, check and symbol node degree distributions. The proposed algorithm is thus interesting if a family of irregular codes with a complex check node degree distribution is used.Comment: 3 pages, 3 figure

The baryon-decuplet in the chiral dynamics of Lambda-hyperons in nuclear matter

We study the long range part of the $\Lambda$-hyperon optical potential in nuclei using Quantum Many Body techniques and flavor-SU(3) Chiral Lagrangians as starting point. More precisely, we study the contributions to the $\Lambda$-hyperon optical potential due to the long-range two-pion exchange, with $\Sigma$ and $\Sigma^*$ baryons in the internal baryonic lines and considering Nh and $\Delta$h excitations. We also consider the contribution to the spin-orbit potentials that comes out from these terms. Our results support a natural explanation of the smallness of the $\Lambda$-nuclear spin-orbit interaction and shows the importance of the $\Sigma^*$ and $\Delta$ degrees of freedom for the hyperon-nucleus interactions.Comment: 8 pages, 5 figure

Blind Reconciliation

Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation efficiency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close to minimal information disclosure but heavily interactive procedures, like Cascade, or using less efficient but also less interactive -just one message is exchanged- procedures, like the ones based in low-density parity-check (LDPC) codes. The price to pay in the LDPC case is that good efficiency is only attained for very long codes and in a very narrow range centered around the quantum bit error rate (QBER) that the code was designed to reconcile, thus forcing to have several codes if a broad range of QBER needs to be catered for. Real world implementations of these methods are thus very demanding, either on computational or communication resources or both, to the extent that the last generation of GHz clocked QKD systems are finding a bottleneck in the classical part. In order to produce compact, high performance and reliable QKD systems it would be highly desirable to remove these problems. Here we analyse the use of short-length LDPC codes in the information reconciliation context using a low interactivity, blind, protocol that avoids an a priori error rate estimation. We demonstrate that 2x10^3 bits length LDPC codes are suitable for blind reconciliation. Such codes are of high interest in practice, since they can be used for hardware implementations with very high throughput.Comment: 22 pages, 8 figure

Untainted Puncturing for Irregular Low-Density Parity-Check Codes

Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.Comment: 4 pages, 3 figure

Rate Compatible Protocol for Information Reconciliation: An application to QKD

Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation

Gauge-invariant implications of the LHCb measurements on Lepton-Flavour Non-Universality

We study the implications of the recent measurements of $R_K$ and $R_{K^*}$ by the LHCb collaboration. We do that by adopting a model-independent approach based on the Standard Model Effective Field Theory (SMEFT), in which the dominant new physics effects are encoded in the coefficients of dimension-six operators respecting the full Standard Model (SM) gauge symmetry. After providing simplified expressions for $R_K$ and $R_{K^\ast}$, we determine the implications of the recent LHCb results for these observables on the coefficients of the SMEFT operators at low and high energies. We also take into account all $b\to s \ell\ell$ data, which combined lead to effective New Physics (NP) scenarios with SM pulls in excess of 5~$\sigma$. Thus the operators discussed in this paper would be the first dimension-six terms in the SM Lagrangian to be detected experimentally. Indirect constraints on these operators are also discussed. The results of this paper transcend the singularity of the present situation, and set a standard for future analyses in $b\to s$ transitions when the NP is assumed to lie above the electroweak scale.Comment: 10 pages, 2 figures, 3 tables. v2: references added, typos corrected, improved discussion in Sec. V, corrected coefficient of C7 in formula for RKstar in the low-bin, new figure with global fit in terms of SMEFT coefficients. Conclusions unchanged. v3: minor addition, shorter version to be published in PR

Minimal 3-loop neutrino mass models and charged lepton flavor violation

We study charged lepton flavor violation for the three most popular 3-loop Majorana neutrino mass models. We call these models "minimal" since their particle content correspond to the minimal sets for which genuine 3-loop models can be constructed. In all the three minimal models the neutrino mass matrix is proportional to some powers of Standard Model lepton masses, providing additional suppression factors on top of the expected loop suppression. To correctly explain neutrino masses, therefore large Yukawa couplings are needed in these models. We calculate charged lepton flavor violating observables and find that the three minimal models survive the current constraints only in very narrow regions of their parameter spaces.Comment: 32+7 pages, 23 figures, 7 table